An Equivalent Matrix Pencil for Bivariate Polynomial Matrices
نویسنده
چکیده
In this paper, we present a simple algorithm for the reduction of a given bivariate polynomial matrix to a pencil form which is encountered in Fornasini-Marchesini’s type of singular systems. It is shown that the resulting matrix pencil is related to the original polynomial matrix by the transformation of zero coprime equivalence. The exact form of both the matrix pencil and the transformation connecting it to the original matrix are established.
منابع مشابه
Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach
Abstract. We revisit the important paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 971–1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key properties of linearizations for matrix polynomials. We also show that every pencil in the double ansatz space is intrinsically connected to a Bézout...
متن کاملOn the Computation of the Minimal Polynomial of a Polynomial Matrix
It is well known from the Cayley Hamilton theorem that every matrix A ∈ Rr×r satisfies its characteristic equation (Gantmacher, 1959), i.e., if p (s) := det (sIr −A) = sr+p1sr−1+· · ·+pr, then p (A) = 0. The Cayley Hamilton theorem is still valid for all cases of matrices over a commutative ring (Atiyah and McDonald, 1964), and thus for multivariable polynomial matrices. Another form of the Cay...
متن کاملOn the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition
Under the action of the general linear group, the ranks of matrices A and B forming a m × n pencil A+ λB can change, but in a restricted manner. Specifically, to every pencil one can associate a pair of minimal ranks, which is unique up to a permutation. This notion can be defined for matrix pencils and, more generally, also for matrix polynomials of arbitrary degree. The natural hierarchy it i...
متن کاملSymmetric Linearizations for Matrix Polynomials
A standard way of treating the polynomial eigenvalue problem P (λ)x = 0 is to convert it into an equivalent matrix pencil—a process known as linearization. Two vector spaces of pencils L1(P ) and L2(P ), and their intersection DL(P ), have recently been defined and studied by Mackey, Mackey, Mehl, and Mehrmann. The aim of our work is to gain new insight into these spaces and the extent to which...
متن کاملA note on companion pencils
Various generalizations of companion matrices to companion pencils are presented. Companion matrices link to monic polynomials, whereas companion pencils do not require monicity of the corresponding polynomial. In the classical companion pencil case (A,B) only the coefficient of the highest degree appears in B’s lower right corner. We will show, however, that all coefficients of the polynomial ...
متن کامل